Maximin Latin Hypercube Designs in Two Dimensions
نویسندگان
چکیده
منابع مشابه
Maximin Latin Hypercube Designs in Two Dimensions
Users may download and print one copy of any publication from the public portal for the purpose of private study or research You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright, please contact...
متن کاملOrthogonal-maximin Latin Hypercube Designs
A randomly generated Latin hypercube design (LHD) can be quite structured: the variables may be highly correlated or the design may not have good space-filling properties. There are procedures for finding good LHDs by minimizing the pairwise correlations or by maximizing the inter-site distances. In this article we show that these two criteria need not be in close agreement. We propose a multi-...
متن کاملBounds for Maximin Latin Hypercube Designs
Latin hypercube designs (LHDs) play an important role when approximating computer simulation models. To obtain good space-filling properties, the maximin criterion is frequently used. Unfortunately, constructing maximin LHDs can be quite time-consuming when the number of dimensions and design points increase. In these cases, we can use approximate maximin LHDs. In this paper, we construct bound...
متن کاملOn Simulated Annealing Dedicated to Maximin Latin Hypercube Designs
The goal of our research was to enhance local search heuristics used to construct Latin Hypercube Designs. First, we introduce the 1D-move perturbation to improve the space exploration performed by these algorithms. Second, we propose a new evaluation function ψp,σ specifically targeting the Maximin criterion. Exhaustive series of experiments with Simulated Annealing, which we used as a typical...
متن کاملTwo-dimensional minimax Latin hypercube designs
We investigate minimax Latin hypercube designs in two dimensions for several distance measures. For the `-distance we are able to construct minimax Latin hypercube designs of n points, and to determine the minimal covering radius, for all n. For the `1-distance we have a lower bound for the covering radius, and a construction of minimax Latin hypercube designs for (infinitely) many values of n....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2007
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1060.0317